Sparse topologies with small spectrum size
نویسندگان
چکیده
منابع مشابه
Sparse topologies with small spectrum size
One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplace matrix. Determining this number is of theoretical interest as well as of practical impact. Sparse graphs with small spectra exhibit excellent structural properties and can act as interconnection topologies. In this paper, for any n we present graphs, for which the product of their vert...
متن کاملScalable Sparse Topologies with Small Spectrum
One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplacian matrix. Determining this number is of theoretical interest and also of practical impact. Graphs with small spectra exhibit many symmetry properties and are well suited as interconnection topologies. Especially load balancing can be done on such interconnection topologies in a small n...
متن کاملSparse Neural Networks Topologies
We propose Sparse Neural Network architectures that are based on random or structured bipartite graph topologies. Sparse architectures provide compression of the models learned and speed-ups of computations, they can also surpass their unstructured or fully connected counterparts. As we show, even more compact topologies of the so-called SNN (Sparse Neural Network) can be achieved with the use ...
متن کاملCardinalities of Topologies with Small Base
Let T be the family of open subsets of a topological space (not necessarily Hausdorff or even T0). We prove that if T has a base of cardinality ≤ μ, λ ≤ μ < 2, λ strong limit of cofinality א0, then T has cardinality ≤ μ or ≥ 2. This is our main conclusion (21). In Theorem 2 we prove it under some set theoretic assumption, which is clear when λ = μ; then we eliminate the assumption by a theorem ...
متن کاملSmall - World Internet Topologies
Recent work has shown the prevalence of small-world phenomena [28] in many networks. Small-world graphs exhibit a high degree of clustering, yet have typically short path lengths between arbitrary vertices. Internet AS-level graphs have been shown to exhibit small-world behaviors [9]. In this paper, we show that both Internet AS-level and routerlevel graphs exhibit small-world behavior. We attr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00237-8